Decision problems for node label controlled graph grammars

Graph grammars with node-label controlled rewriting and embedding

Induction of Node Label Controlled Graph Grammar Rules

Algorithms for inducing graph grammars from sets of graphs have been proposed before. An important class of such algorithms are those based on the Subdue graph mining system. But the rules learned by Subdue and its derivatives do not fit easily in any of the well-studied graph grammars formalisms. In this paper, we discuss how Subdue-like algorithms could be made to work in the context of NLC g...

Note on Node-Rewriting Graph Grammars

In various fields of computer science one has to manipulate complex data objects which have graph representations. Hence the study of ‘constructive’ graph processing mechanisms turns out to be of great importance. The theory of graph grammars can be seen as a part of such a study. In this note we discuss the relationship of two lines of development within the theory of graph grammars: the ‘Berl...

Inference of node replacement graph grammars

Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to discover knowledge from data. In this paper we describe an approach to learning node replacement graph grammars. This approach is based on previous research in frequent isomorphic subgraphs discovery. We extend the search...

Inference of Node Replacement Recursive Graph Grammars

In this paper we describe an approach to learning node replacement graph grammars. This approach is based on previous research in frequent isomorphic subgraphs discovery. We extend the search for frequent subgraphs by checking for overlap among the instances of the subgraphs in the input graph. If subgraphs overlap by one node we propose a node replacement grammar production. We also can infer ...